Minimal universal quantum heat machine

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal universal quantum heat machine.

In traditional thermodynamics the Carnot cycle yields the ideal performance bound of heat engines and refrigerators. We propose and analyze a minimal model of a heat machine that can play a similar role in quantum regimes. The minimal model consists of a single two-level system with periodically modulated energy splitting that is permanently, weakly, coupled to two spectrally separated heat bat...

متن کامل

Universal Quantum Compression with Minimal Prior Knowledge

A Universal Compression scheme is presented, to compress sequences of quantum information from unknown quantum sources (i.e. described by unknown density matrix ρ) asymptotically to S(ρ), with fidelity bounded toward unity. The introduction of a“B-diagonalisation” process allows us to treat the input as if it were diagonal in a known basis B. Applying a version of the Lempel-Ziv algorithm in th...

متن کامل

Deutsch's Universal Quantum Turing Machine (revisited)

Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a finite number of qubits. This interesting problem has been addressed most famously in a paper by Deutsch, and later by Bernstein and Vazirani. Quantum Turing...

متن کامل

Optimal Universal Disentangling Machine for Two Qubit Quantum States

We derive an upper limit for the reduction factor for universal disentangling machine which uses only local operations. Impossibility of constructing a better disentangling machine, by using non-local operations, is discussed.

متن کامل

Minimal Universal Bipartite Graphs

A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with minimum number of vertices for various classes of bipartite graphs: exponential classes of bipartite (and general) graphs, bipartite chain graphs, bipartite permutation graphs, and general bipartite graphs. For exponential...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2013

ISSN: 1539-3755,1550-2376

DOI: 10.1103/physreve.87.012140